SéMantiques et Syntaxes vectorielles de la logique LinéAIRE. (Vectorial Semantics and Syntax of Linear Logic)

نویسنده

  • Christine Tasson
چکیده

VECTORIAL SEMANTICS AND SYNTAX OF LINEAR LOGICWith finiteness spaces, Ehrhard has shown a semantics of linear logic with a differentiationoperation. In this framework, the interpretation of formulas can be represented as Taylor series.This has led to the introduction of a differential syntax. This thesis in denotational semanticspursues this work through an exploration of vectorial semantics of linear logic and contributesto the semantic and syntactic study of the Taylor formula.In the first part, we tackle semantics. We present the interpretation of linear logic construc-tions in linearised topological vector spaces. We build an intrinsic notion of finiteness spaces,named finitary Lefschetz spaces. We characterise the linearised topological vector spaces whichare reflexive and complete thanks to linear bornologies. Last, we show that the Taylor seriesproperty of finiteness spaces is still true in the linearised topological vector spaces framework.The second part is about differential syntax. The syntactic Taylor formula translate termsinto a sum of differential terms representing different executions. As shown by Ehrhard andRegnier, the terms that are the target of this translation are coherent. We introduce a totalsemantics which catch this relation. We build a linear extension of lambda-calculus, namedbarycentric-calculus, interpreted by the total semantics. Finally, in the differential nets frame-work, we present a non-deterministic algorithm which decides if a finite set of differential netscomes from a linear logic net through the syntactic Taylor formula.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analyse de dépendances et correction des réseaux de preuve

Les fruits de Curry-Howard. Depuis la mise en évidence via la correspondance de CurryHoward [21], des relations entre démonstrations mathématiques et programmes informatiques, théorie de la programmation et théorie de la démonstration s’enrichissent mutuellement. Parmi les nombreux allers-retours fructueux entre preuves et programmes, la logique linéaire [13] tient une place exemplaire. Girard ...

متن کامل

A self-dual modality for “before” in the category of coherence spaces and in the category of hypercoherences

In his paper “A new constructive logic: classical logic” Jean-Yves Girard brought up the question of a self-dual modality. This note provides a semantical solution with respect to the self-dual connective before in the category of coherence spaces, and in the category of hypercoherences. Key-words: Denotational semantics. Logic, proof theory, linear logic. (Résumé : tsvp) [email protected] A more...

متن کامل

Extracting critical scenarios from a Petri net model using linear logic

RÉSUMÉ. La connaissance des scénarios critiques est indispensable, dès la phase de conception des systèmes mécatroniques, afin d’estimer leur sûreté de fonctionnement. Ceci permet de valider les reconfigurations et d’orienter le choix de l’architecture de ces systèmes. Cet article présente une méthode de recherche de scénarios potentiellement dangereux dans un cadre formel (logique linéaire) à ...

متن کامل

Vérification des propriétés temporisées des automates programmables industriels. (Verification of timed properties of programmable logic controllers)

ion des états transitoires À partir des problèmes pratiques posés par la modélisation des APIs, nous avons isolé une question théorique : celle de la vérification de propriétés temporisées “partout sauf sur un sous-ensemble d’états de mesure bornée (éventuellement nulle)”. En effet, la modélisation des programmes de contrôle des automates programmables industriels produit naturellement des auto...

متن کامل

Static verification of dynamical integrity constraints a semantics based approach

We address the problem of statically proving, at compilation time, whether the execution of a given transaction m is safe w.r.t. a dynamical integrity constraint in the framework of object oriented database systems. To do so, we formalize dynamical constraints with first order Linear Temporal Logic formulae and we use predicate transformer “à la Dijkstra”, combined with automatic demonstration....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009